New Techniques for Proving the Decidability of Equivalence Problems
نویسنده
چکیده
We will discuss severai recentI) developed :e_h.ci;ues for prcving the decidability of the equivalence problem for devices den #III& languages and relations. Most of these techniques come from the development originat,d 1;1 the proof of the decidability of the DOL equivalence problem. Of particular importance is c.te recently shown validity of the Ehrenieucht conjecture and its effective variations.
منابع مشابه
A Uniform Approach for Proving the Polynomial Time Decidability of Simulation Relations for Finite State Processes
We present a uniform approach for proving the polynomial time decidability of various simulation and equivalence relations for nite state processes. Our approach applies directly to a number of simulation relations and equivalences considered in the literature including strong bisimulation Par81, Mil80, KS90], simulation equivalence vG90, HT94], ready-simulation equivalence vG90, HT94], complet...
متن کاملDecidable and Undecidable Second-Order Unification Problems
There is a close relationship between word unification and second-order unification. This similarity has been exploited for instance for proving decidability of monadic second-order unification. Word unification can be easily decided by transformation rules (similar to the ones applied in higher-order unification procedures) when variables are restricted to occur at most twice. Hence a well-kno...
متن کاملAlgebraic and Model Theoretic Techniques for Fusion Decidability in Modal Logics
We introduce a new method (derived from model theoretic general combination procedures in automated deduction) for proving fusion decidability in modal systems. We apply it to show fusion decidability in case not only the boolean connectives, but also a universal modality and nominals are shared symbols.
متن کاملSchema Revisited
Two schema problems from the 1970s are examined, monadic recursion schemes and first-order recursion schemas. Research on these problems halted because they were shown to be equivalent to the problem of decidability of language equivalence between DPDA (deterministic pushdown automata). Recently a decidability proof for equivalence of DPDA was given by Sénizergues [10, 11], which therefore also...
متن کاملA Type System for proving Depth Boundedness in the pi-calculus
The depth-bounded fragment of the π-calculus is an expressive class of systems enjoying decidability of some important verification problems. Unfortunately membership of the fragment is undecidable. We propose a novel type system, parameterised over a finite forest, that formalises name usage by π-terms in a manner that respects the forest. Type checking is decidable and type inference is compu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1988